Forbidding and enforcing on graphs
نویسندگان
چکیده
We define classes of graphs based on forbidding and enforcing boundary conditions. Forbidding conditions prevent a graph to have certain combinations of subgraphs and enforcing conditions impose certain subgraph structures.We say that a class of graphs is an fe-class if the class can be defined through forbidding and enforcing conditions (fe-system). We investigate properties of fe-systems and characterize familiar classes of graphs such as paths and cycles, trees, bi-partite, complete, Eulerian, and k-regular graphs as fe-classes. © 2012 Elsevier B.V. All rights reserved.
منابع مشابه
Forbidding-Enforcing Properties in DNA Self-Assembly of Graphs
Sstarting from a set of strands (or other types of building blocks) a variant of forbidding-enforcing systems for graphs is proposed which models the DNA self-assembly process. The possible outcomes of the self-assembly process comply with necessary constraints arising from the physical and chemical properties of DNA. A set of forbidding and enforcing rules that describe these constraints are p...
متن کاملDefining structures through forbidding and enforcing constraints
This paper introduces a new way of modeling classes of physical and biochemical processes and structures based on boundary conditions that are called ‘‘forbidden’’ and ‘‘enforced’’. The model of forbidding–enforcing systems (fe-systems) is presented in a general categorical sense and we use three specific examples of categories to illustrate three different phenomena. The hydrogen and covalent ...
متن کاملForbidding Sets and Normal Forms for Language Forbidding-Enforcing Systems
This paper investigates ways to reduce redundancy in forbidding sets for language forbidding-enforcing systems. A language forbidding set disallows combinations of subwords in a word, while permitting the presence of some parts of these combinations. Since a forbidding set is a potentially infinite set of finite sets of words, finding normal forms for forbidding sets is interesting from a combi...
متن کاملResearch Summary
Inspired by biomolecular reactions and processes Rozenberg and Ehrenfeucht define forbidding and enforcing systems (fe-systems) on languages and study their language theoretical and computational properties (see [8–10, 41]). The general idea of the forbidding-enforcing paradigm is that a class of structures is defined by a pair of constraints, called an fe-system. In their model, an fe-system d...
متن کاملDefining Languages by Forbidding-Enforcing Systems
Motivated by biomolecular computing, forbidding-enforcing systems (fe-systems) were first used to define classes of languages (fefamilies) based on boundary conditions. This paper presents a new model of fe-systems in which fe-systems define single languages (fe-languages) based on forbidden and enforced subwords. The paper characterizes wellknown languages by fe-systems, investigates the relat...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Theor. Comput. Sci.
دوره 429 شماره
صفحات -
تاریخ انتشار 2012